Graphons, Cut Norm and Distance, Couplings and Rearrangements
نویسنده
چکیده
We give a survey of basic results on the cut norm and cut metric for graphons (and sometimes more general kernels), with emphasis on the equivalence problem. The main results are not new, but we add various technical complements. We allow graphons on general probability spaces whenever possible. We also give some new results for {0,1}-valued graphons.
منابع مشابه
On the computability of graphons
We investigate the relative computability of exchangeable binary relational data when presented in terms of the distribution of an invariant measure on graphs, or as a graphon in either L or the cut distance. We establish basic computable equivalences, and show that L representations contain fundamentally more computable information than the other representations, but that 0′ suffices to move b...
متن کاملRole of short distance behavior in off-shell open-string field theory.
A recent proposal for a background independent open string field theory is studied in detail for a class of backgrounds that correspond to general quadratic boundary interactions on the world-sheet. A short-distance cut-off is introduced to formulate the theory with a finite number of local and potentially unrenormalizable boundary couplings. It is shown that renormalization of the boundary cou...
متن کاملHESITANT FUZZY INFORMATION MEASURES DERIVED FROM T-NORMS AND S-NORMS
In this contribution, we first introduce the concept of metrical T-norm-based similarity measure for hesitant fuzzy sets (HFSs) {by using the concept of T-norm-based distance measure}. Then,the relationship of the proposed {metrical T-norm-based} similarity {measures} with the {other kind of information measure, called the metrical T-norm-based} entropy measure {is} discussed. The main feature ...
متن کاملA Gene Family-Free model for Genome Rearrangements with Insertions and Deletions
In comparative genomics methods for structural evolution, a common pre-processing step is to perform an orthology detection method to classify genes into gene families, in order to represent each chromosome as an ordering of genes of the detected families. This allows, for instance, the application of genome rearrangement distance methods, such as the Double Cut and Join model. A recent approac...
متن کاملFinitely forcible graphons
We investigate families of graphs and graphons (graph limits) that are determined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by finitely many subgraph densities. Generalizing results of Turán, Erdős–Simonovits and Chung–Graham–Wilson, we construct numerous finitely forcible graphon...
متن کامل